package com.algrithom.graph.dfs;

import java.util.Objects;

import com.common.model.Vertex;

/**
 * 邻接表的深度优先遍历
 *
 * @author think
 * @version 1.0.0
 * @since 2020/3/7
 */
public class Solution2 {
    
    private static void dfs(Vertex node){
        if (Objects.nonNull(node) && !node.isVisted()) {
            dfs(node.getNextNode());
        }
    }
}
